|
Elliptic curve cryptography is a popular form of public key encryption that is based on the mathematical theory of elliptic curves. Points on an elliptic curve can be added and form a group under this addition operation. This article describes the computational costs for this group addition and certain related operations that are used in elliptic curve cryptography algorithms. ==Abbreviations for the operations== The next section presents a table of all the time-costs of some of the possible operations in elliptic curves. The columns of the table are labelled by various computational operations. The rows of the table are for different models of elliptic curves. These are the operations considered : DBL - Doubling ADD - Addition mADD - Mixed addition: addition of an input that has been scaled to have ''Z''-coordinate 1. mDBL - Mixed doubling: doubling of an input that has been scaled to have ''Z'' coordinate 1. TPL - Tripling. To see how adding (ADD) and doubling (DBL) points on elliptic curves are defined, see The group law. The importance of doubling to speed scaler multiplication is discussed after the table. For information about other possible operations on elliptic curves see http://hyperelliptic.org/EFD/g1p/index.html. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Table of costs of operations in elliptic curves」の詳細全文を読む スポンサード リンク
|